A New Biased Model Order Reduction for Higher Order Interval Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithm for Model Order Reduction of Interval Systems

ISSN 2277 5048 | © 2013 Bonfring Abstract--Mixed method of interval systems is a combination of classical reduction methods and stability preserving methods of interval systems. This paper proposed a new method for model order reduction of systems with uncertain parameters. The bounds on the uncertain parameters are known a priori. Two separate methods are used for finding parameters of the num...

متن کامل

A New Method of Order Reduction for High Order Interval Systems Using Least Squares Method

The paper presents the application of Least Squares moment matching method about a general point „a‟ for the reduction of high order Interval systems. A heuristic criteria have been employed for selecting the linear shift point „a‟ based upon the harmonic mean of real parts of the poles of four high order fixed systems obtained by Kharitonov‟s Theorem. The denominator polynomials are obtained b...

متن کامل

Comparing Combinatory Reduction Systems and Higher - Order

In this paper two formats of higher-order rewriting are compared: Combinatory Reduction Systems introduced by Klop Klo80] and Higher-order Rewrite Systems deened by Nipkow Nipa]. Although it always has been obvious that both formats are closely related to each other, up to now the exact relationship between them has not been clear. This was an unsatisfying situation since it meant that proofs f...

متن کامل

Moment Matching Theorems for Dimension Reduction of Higher-Order Dynamical Systems via Higher-Order Krylov Subspaces

Moment matching theorems for Krylov subspace based model reduction of higherorder linear dynamical systems are presented in the context of higher-order Krylov subspaces. We introduce the definition of a nth-order Krylov subspace Kn k ({Ai} n i=1;u) based on a sequence of n square matrices {Ai}i=1 and vector u. This subspace is a generalization of Krylov subspaces for higher-order systems, incor...

متن کامل

A Reduction Ordering for Higher - Order

We investigate one of the classical problems of the theory of term rewriting, namely termination. We present an ordering for comparing higher-order terms that can be utilized for testing termination and decreasingness of higher-order conditional term rewriting systems. The ordering relies on a rst-order interpretation of higher-order terms and a suitable extension of the RPO. 1 Motivation Term ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Electrical and Electronic Engineering

سال: 2016

ISSN: 1804-3119,1336-1376

DOI: 10.15598/aeee.v14i2.1395